The Nonlinear Generalized Transportation Problem with convex costs
نویسندگان
چکیده
منابع مشابه
The Nonlinear Generalized Transportation Problem with convex costs ∗
We investigate the Nonlinear Generalized Transportation Problem (NGTP), where the transportation costs and the costs that depend on the amount of good delivered to the destination points are strictly convex functions. The amounts of goods change during the transportation process. This model may correspond, for example, with a congested network where the time costs are involved. First, we presen...
متن کاملFuzzy Transportation Problem with Random Transportation Costs
We consider the following transportation problem with both random and fuzzy factors. There exist m supply points and n demand points. For each route between supply point and demand point, unit transportation cost is a random variable according to a normal distribution and existence possibility denoting the preference choosing this route is attached. The probability that the total transportation...
متن کاملThe KKT optimality conditions for constrained programming problem with generalized convex fuzzy mappings
The aim of present paper is to study a constrained programming with generalized $alpha-$univex fuzzy mappings. In this paper we introduce the concepts of $alpha-$univex, $alpha-$preunivex, pseudo $alpha-$univex and $alpha-$unicave fuzzy mappings, and we discover that $alpha-$univex fuzzy mappings are more general than univex fuzzy mappings. Then, we discuss the relationships of generalized $alp...
متن کاملDynamic Scheduling with Convex Delay Costs: The Generalized c Rule
We consider a general single-server multiclass queueing system that incurs a delay cost Ck( k) for each class k job that resides k units of time in the system. This paper derives a scheduling policy that minimizes the total cumulative delay cost when the system operates during a nite time horizon. Denote the marginal delay cost and (instantaneous) service rate functions of class k by ck = C 0 k...
متن کاملSOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS
Numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. Other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(FSPP). The main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Croatian Operational Research Review
سال: 2015
ISSN: 1848-0225,1848-9931
DOI: 10.17535/crorr.2015.0018